A note on constructing infinite binary words with polynomial subword complexity
نویسندگان
چکیده
منابع مشابه
A note on constructing infinite binary words with polynomial subword complexity
Most of the constructions of infinite words having polynomial subword complexity are quite complicated, e.g., sequences of Toeplitz, sequences defined by billiards in the cube, etc. In this paper, we describe a simple method for constructing infinite words w over a binary alphabet {a, b} with polynomial subword complexity pw. Assuming w contains an infinite number of a’s, our method is based on...
متن کاملOn Minimal Words With Given Subword Complexity
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fibonacci number defined by F1 = F2 = 1 and Fn = Fn−1 + Fn−2 for n > 2. We also give an algorithm that generates a minimal word Sn for each n ≥ 1. 1991 Mathematics Subject Classification: Primary 68R15; Secondary 05C35. 0 In...
متن کاملConstructing Infinite Words of Intermediate Complexity
We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential. The first one is rather simple but produces a word which is not uniformly recurrent. The second construction, more involved, produces uniformly recurrent words and allows to choose the growth of the complexity function in a large family.
متن کاملThe Maximal Subword Complexity of Quasiperiodic Infinite Words
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived from q. It is shown that this language is a suffix code having a bounded delay of decipherability. Our estimate of the subword complexity uses this property, e...
متن کاملSubword Metrics for Infinite Words
The space of one-sided infinite words plays a crucial rôle in several parts of Theoretical Computer Science. Usually, it is convenient to regard this space as a metric space, the Cantor-space. It turned out that for several purposes topologies other than the one of the Cantor-space are useful, e.g. for studying fragments of first-order logic over infinite words or for a topological characterisa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2013
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2013033